Wide - sense Non - blocking Multirate and Multicast log 2 ( N ; m ; p ) Switching Networks
نویسنده
چکیده
In this paper we are going to investigate the non-blocking operation of multirate log2(N; m; p) switching networks with multicast connections. The nonblocking operation of multi-log2N switching networks for point-to-point connections was firstly considered in [5, 6]. Conditions under which these switching networks are nonblocking for multicast connections were proposed by Tscha and Lea [7] and corrected by the same authors in [8]. They considered a wide-sense nonblocking switching networks and proposed a control algorithm based on the blocking window of a given size. Their results were later generalized by Danilewicz and Kabaciński to blocking windows of any size [9, 10, 11]. Multirate multi-log2N switching networks for point-to-point connections were considered by Lea in [14] and by Kabaciński and Żal in [15]. Frank K. Hwang and Bey-Chi Lin in [17] made an attempt to extended these connections to multicast log2(N; m; p) networks but encountered some difficulties which were commented by Danilewicz and Kabaciński in [18] where the correct results were given. In this paper we will extend these known results to multirate c switching networks with multicast connections and this is the continuation of results given in [16, 17] and [18]. The nonblocking operation at the connection level is considered.
منابع مشابه
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to derive a formula for the minimum number of some switching components so that the design is non-blocking in some sense (e.g., strict-sense or wide-sense). We show that, in many cases, this task can be accomplished with a very simple and effective two-step strategy: (1) formulate a...
متن کاملWide-sense and strict-sense nonblocking operation of multicast multi-log2 n switching networks
Multicast connections are used in broad-band switching networks as well as in parallel processing. We consider wide-sense and strict-sense nonblocking conditions for multi-log 2 switching networks with multicast connections in this paper. We prove that such networks are wide-sense nonblocking if they are design by vertically stacking at least 2 1 + 2 2 1 planes of a log 2 networks together, whe...
متن کاملNonblocking Multirate Distribution Networks
This paper generalizes known results for nonblocking distribution networks also known as generalized connection networks to the mul tirate environment where di erent user connec tions share a switch s internal data paths in arbi trary fractions of the total capacity In particular we derive conditions under which networks due to Ofman and Thompson Pippenger and Turner lead to multirate distribut...
متن کاملAnalyzing Nonblocking Multilog Networks with the köNIG-Egevarý Theorem
When analyzing a nonblocking switching network, the typical problem is to find a route for a new request through the network without disturbing existing routes. By solving this problem, we can derive how many hardware components of a certain type (Banyan planes in a multi-log network, for instance) are needed for the network to be nonblocking. This scenario appears in virtually all combinations...
متن کاملua nt - p h / 02 07 06 4 v 1 1 1 Ju l 2 00 2 Digital Switching in the Quantum Domain
In this paper, we present an architecture and implementation algorithm such that digital data can be switched in the quantum domain. First we define the connection digraph which can be used to describe the behavior of a switch at a given time, then we show how a connection digraph can be implemented using elementary quantum gates. The proposed mechanism supports unicasting as well as multicasti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007